Ranked Set Search in Medline Documents.

Topic Evolution in a Stream of Documents.

Visualizing Clustering Results.
Non-hierarchical clustering has a long history in numerical taxonomy [13] and machine learning [1] with many applications in fields such as data mining [2], statistical analysis [3] and information retrieval [17]. Clustering involves finding a specific number of subgroups (k) within a set of s observations (data points/objects); each described by d
LWA 2007.
We thank our sponsors:
LWA 2007 Lernen %2D Wissen %2D Adaption
We thank our sponsors:
Fast Approximate Duplicate Detection for 2D%2DNMR Spectra.

An Evaluation of Text Retrieval Methods for Similarity Search of Multi%2Ddimensional NMR%2DSpectra.
Abstract. Searching and mining nuclear magnetic resonance (NMR)spectra of naturally occurring substances is an important task to investigate new potentially useful chemical compounds. Multi-dimensional NMR-spectra are relational objects like documents, but consists of continuous multi-dimensional points called peaks instead of words. We develop several mappings from continuous NMR-spectra to discrete textlike data. With the help of those mappings any text retrieval method can be applied. We evaluate the performance of two retrieval methods, namely the standard vector space model and probabilistic latent semantic indexing (PLSI). PLSI learns hidden topics in the data, which is in case of 2D-NMR data interesting in its owns rights. Additionally, we develop and evaluate a simple direct similarity function, which can detect duplicates of NMR-spectra. Our experiments show that the vector space model as well as PLSI, which are both designed for text data created by humans, can effectively handle the mapped NMR-data originating from natural products. Additionally, PLSI is able to find meaningful ”topics” in the NMR-data. 1
Fast Approximate Duplicate Detection for 2D%2DNMR Spectra.

An Application of Latent Topic Document Analysis to Large%2DScale Proteomics Databases.

Bayesian Folding%2DIn with Dirichlet Kernels for PLSI.

DENCLUE 2.0 Fast Clustering Based on Kernel Density Estimation.
 The Denclue algorithm employs a cluster model based on kernel density estimation. A cluster is defined by a local maximum of the estimated density function. Data points are assigned to clusters by hill climbing, i.e. points going to the same local maximum are put into the same cluster. A disadvantage of Denclue 1.0 is, that the used hill climbing may make unnecessary small steps in the beginning and never converges exactly to the maximum, it just comes close. We introduce a new hill climbing procedure for Gaussian kernels, which adjusts the step size automatically at no extra costs. We prove that the procedure converges exactly towards a local maximum by reducing it to a special case of the expectation maximization algorithm. We show experimentally that the new procedure needs much less iterations and can be accelerated by sampling based methods with sacrificing only a small amount of accuracy. 
Clustering using EM%2Dbased Hill%2DClimbing on Kernel Density Estimation.
We thank our sponsors:
Workshop on Knowledge Discovery
Combining multiple classifiers is of particular interest in the multimedia systems, since there is usually data of very different types/modalities that should be mined or analyzed. Our wearable `experience collection&#039; system unobtrusively records the wearer&#039;s conversation, recognizes the face of the dialog partner and remembers his/her voice. When the system sees the same person&#039;s face or hears the same voice it can then use a summary of the last conversation with this person to remind the wearer. To correctly identify a person from a mixture of video and audio stream, classification judgments from individual modality classifiers must be combined effectively to yield a more accurate decision. To address the problems of combination strategy in previous studies, a meta-classification strategy using Support Vector Machine is proposed. Preliminary results show that combining different face recognition and speaker identification technology by metaclassification is dramatically more effective than weighted interpolation. Meta-classification is general enough to be applied to any application that needs to combine multiple classifiers without much modification.
Clustering using EM%2Dbased Hill%2DClimbing on Kernel Density Estimation.
We thank our sponsors:
Analysing latent topics in large%2Dscale proteomics.
We thank our sponsors:
Analysing latent topics in large%2Dscale proteomics.
We thank our sponsors:
Duplicate detection of 2D%2DNMR Spectra.
2D-Nuclear magnetic resonance (NMR) spectra are used in the (structural) analysis of small molecules. In contrast to 1D-NMR spectra, 2D-NMR spectra correlate the chemical shifts of 1 H and 13 C at the same time. A spectrum consists of several peaks in a twodimensional space. The most important information of a peak is the location of its center, which captures the bonding relationships of hydrogen and carbon atoms. A spectrum contains much information about the chemical structure of a product, but in most cases the structure cannot be read off in a simple and straightforward manner. Structure elucidation involves a considerable amount (manual) efforts. Using high-field NMR spectrometers, many 2D-NMR spectra can be recorded in short time. So the common situation is that a lab or company has a repository of 2D-NMR spectra, partially annotated with the structural information. For the remaining spectra the structure in unknown. In case two research labs are collaborating, the repositories will be merged and annotations shared. We reduce that problem to the task of finding duplicates in a given set of 2D-NMR spectra. Therefore, we propose a simple but robust definition of 2D-NMR duplicates, which allows for small measurement errors. We give a quadratic algorithm for the problem, which can be implemented in SQL. Further, we analyze a more abstract class of heuristics, which are based on selecting particular peaks. Such a heuristic works as a filter step on the pairs of possible duplicates and allows false positives. We compare all methods with respect to their run time. Finally we discuss the effectiveness of the duplicate definition on real data. 1
Tagungsband zum 18. GI%2DWorkshop %FCber Grundlagen von Datenbanken %2818th GI%2DWorkshop on the Foundations of Databases%29

An Evaluation of Text Retrieval Methods for Similarity Search of multi%2Ddimensional NMR%2DSpectra.
Abstract. Searching and mining nuclear magnetic resonance (NMR)spectra of naturally occurring substances is an important task to investigate new potentially useful chemical compounds. Multi-dimensional NMR-spectra are relational objects like documents, but consists of continuous multi-dimensional points called peaks instead of words. We develop several mappings from continuous NMR-spectra to discrete textlike data. With the help of those mappings any text retrieval method can be applied. We evaluate the performance of two retrieval methods, namely the standard vector space model and probabilistic latent semantic indexing (PLSI). PLSI learns hidden topics in the data, which is in case of 2D-NMR data interesting in its owns rights. Additionally, we develop and evaluate a simple direct similarity function, which can detect duplicates of NMR-spectra. Our experiments show that the vector space model as well as PLSI, which are both designed for text data created by humans, can effectively handle the mapped NMR-data originating from natural products. Additionally, PLSI is able to find meaningful ”topics” in the NMR-data. 1
Similarity Search for Multi%2Ddimensional NMR%2DSpectra of Natural Products.
Abstract. Searching and mining nuclear magnetic resonance (NMR)spectra of naturally occurring products is an important task to investigate new potentially useful chemical compounds. We develop a set-based similarity function, which, however, does not sufficiently capture more abstract aspects of similarity. NMR-spectra are like documents, but consists of continuous multi-dimensional points instead of words. Probabilistic semantic indexing (PLSI) is an retrieval method, which learns hidden topics. We develop several mappings from continuous NMR-spectra to discrete text-like data. The new mappings include redundancies into the discrete data, which proofs helpful for the PLSI-model used afterwards. Our experiments show that PLSI, which is designed for text data created by humans, can effectively handle the mapped NMR-data originating from natural products. Additionally, PLSI combined with the new mappings is able to find meaningful ”topics ” in the NMR-data. 1


Dimension Induced Clustering.

Optimizing Multiple Top%2DK Queries over Joins.
Advanced Data Mining applications require more and more support from relational database engines. Especially clustering applications in high dimensional features space demand a proper support of multiple Top-k queries in order to perform projected clustering. Although some research tackles to problem of optimizing restricted ranking (top-k) queries, there is no solution considering more than one single ranking criterion. This deficit- optimizing multiple Topk queries over joins- is targeted by this paper from two perspectives. On the one hand, we propose a minimal but quite handy extension of SQL to express multiple top-k queries. On the other hand, we propose an optimized hash join strategy to efficiently execute this type of queries. Extensive experiments conducted in this context show the feasibility of our proposal. 1.
Multiresolution similarity search in image databases.

%C4hnlichkeitssuche in Musik%2DDatenbanken mit Hilfe von Visualisierungen.

Visual interaction to solving complex optimization problems.

Visual interaction to solving complex optimization problems.

HD%2DEye %2D Visual Clustering of High dimensional Data.

Database Support for 3D%2DProtein Data Set Analysis.

COMBI%2DOperator Database Support for Data Mining Applications.
Database support for data mining has become  an important research topic. Especially  for large high-dimensional data volumes,  comprehensive support from the database  side is necessary. In this paper we identify  the data intensive subproblem of aggregating  high-dimensional data in all possible  low-dimensional projections (for instance estimating  low-dimensional histograms), which  occurs in several established data mining  techniques. Second, we show that existing  OLAP SQL-extensions are insu#cient for  high-dimensional data and propose a new  SQL-operator, which seamlessly fits into the  set of existing OLAP Group By operators.
A General Approach to Clustering in Large Databases with Noise.

Multi%2DResolution Similarity Search in Image Databases.

HD%2DEye visual clustering of high dimensional data.

On the Surprising Behavior of Distance Metrics in High Dimensional Spaces.
In recent years, the effect of the curse of high dimensionality has been studied in great detail on several problems such as clustering, nearest neighbor search, and indexing. In high dimensional space the data becomes sparse, and traditional indexing and algorithmic techniques fail from a efficiency and/or effectiveness perspective. Recent research results show that in high dimensional space, the concept of proximity, distance or nearest neighbor may not even be qualitatively meaningful. In this paper, we view the dimensionality curse from the point of view of the distance metrics which are used to measure the similarity between objects. We specifically examine the behavior of the commonly used Lk  norm and show that the problem of meaningfulness in high dimensionality is sensitive to the value of k. For example, this means that the Manhattan distance metric (L1 norm) is consistently more preferable than the Euclidean distance metric (L2 norm) for high dimensional data mining applications. Using the intuition derived from our analysis, we introduce and examine a natural extension of the Lk norm to fractional distance metrics. We show that the fractional distance metric provides more meaningful results both from the theoretical and empirical perspective. The results show that fractional distance metrics can significantly improve the effectiveness of standard clustering algorithms such as the k-means algorithm. 1 
Clustering 3D%2Dstructures of Small Aminoacid%2Dchains for Detecting Dependence from Their Sequential Context in Proteins.

High Dimensional Clustering on Large Data Sets.

What Is the Nearest Neighbor in High Dimensional Spaces%3F
Nearest neighbor search in high dimensional spaces is an interesting and important problem which is relevant for a wide variety of novel database applications. As recent results show, however, the problem is a very difficult one, not only with regards to the performance issue but also to the quality issue. In this paper, we discuss the quality issue and identify a new generalized notion of nearest neighbor search as the relevant problem in high dimensional space. In contrast to previous approaches, our new notion of nearest neighbor search does not treat all dimensions equally but uses a quality criterion to select relevant dimensions (projections) with respect to the given query. As an example for a useful quality criterion, we rate how well the data is clustered around the query point within the selected projection. We then propose an efficient and effective algorithm to solve the generalized nearest neighbor problem. Our experiments based on a number of real and synthetic data sets show that our new approach provides new insights into the nature of nearest neighbor search on high dimensional data.
Clustering Techniques for Large Data Sets %2D from the Past to the Future.

Interesting KDD%2DNews from SIGMOD%2799.

Clustering Techniques for Large Data Sets %2D from the Past to the Future.

Clustering Methods for Large Databases From the Past to the Future.%2
Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clusters with arbitrary shape and good efficiency on large databases. The well-known clustering algorithms offer no solution to the combination of these requirements. In this paper, we present the new clustering algorithm DBSCAN relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape. DBSCAN requires only one input parameter and supports the user in determining an appropriate value for it. We performed an experimental evaluation of the effectiveness and efficiency of DBSCAN using synthetic data and real data of the SEQUOIA 2000 benchmark. The results of our experiments demonstrate that (1) DBSCAN is significantly more effective in discovering clusters of arbitrary shape than the well-known algorithm CLAR-ANS, and that (2) DBSCAN outperforms CLARANS by a factor of more than 100 in terms of efficiency.
Clustering Methods for Large Databases From the Past to the Future.%2
Clustering algorithms are attractive for the task of class identification in spatial databases. However, the application to large spatial databases rises the following requirements for clustering algorithms: minimal requirements of domain knowledge to determine the input parameters, discovery of clusters with arbitrary shape and good efficiency on large databases. The well-known clustering algorithms offer no solution to the combination of these requirements. In this paper, we present the new clustering algorithm DBSCAN relying on a density-based notion of clusters which is designed to discover clusters of arbitrary shape. DBSCAN requires only one input parameter and supports the user in determining an appropriate value for it. We performed an experimental evaluation of the effectiveness and efficiency of DBSCAN using synthetic data and real data of the SEQUOIA 2000 benchmark. The results of our experiments demonstrate that (1) DBSCAN is significantly more effective in discovering clusters of arbitrary shape than the well-known algorithm CLAR-ANS, and that (2) DBSCAN outperforms CLARANS by a factor of more than 100 in terms of efficiency.
Optimal Grid%2DClustering Towards Breaking the Curse of Dimensionality in High%2DDimensional Clustering.
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work effectively and efficiently in high-dimensional space, which is due to the so-called &#034;curse of dimensionality&#034;. In addition, the high-dimensional data often contains a significant amount of noise which causes additional effectiveness problems. In this paper, we review and compare the existing algorithms for clustering high-dimensional data and show the impact of the curse of dimensionality on their effectiveness and efficiency. The comparison  reveals that condensation-based approaches (such as BIRCH or STING) are the most promising candidates for achieving the necessary efficiency, but it also shows that basically all condensation-based approaches have severe  weaknesses with respect to their effectiveness in high-dimensional space. To overcome these problems, we develop a new clustering technique called OptiGrid which is based on constructing an optimal grid-...
HD%2DEye Visual Mining of High%2DDimensional Data.
1.INTRODUCTION/MOTIVATION No visualization currently enables both a clear overview and details of associations between elements in large categorical data sets. Many approaches have been taken to address the problem, but each has produced limited results
Detecting relationships between amino acid residue sequences and 3D protein structures based on a new class of rotamer libraries.
In the past a good number of rotamer libraries have been published, which allow a deeper understanding of the conformational behaviour of amino acid residues in proteins. Since the number of available high resolution X-ray protein structures has grown significantly over the last years, a more comprehensive analysis of the conformational behaviour is possible today. In this paper, we present a method to compile a new class of rotamer libraries for detecting interesting relationships between residue conformations and their sequential context in proteins. The method is based on a new algorithm for clustering residue conformations. To demonstrate the effectivity of our method we apply our algorithm to a library consisting of all 8000 tripetid fragments formed by the 20 native amino acids. The analysis shows some very interesting new results, namely that some specific tripeptid fragments show some unexpected conformation of residues instead of the highly preferred conformation. In the neigh...
An Efficient Approach to Clustering in Large Multimedia Databases with Noise.
Several clustering algorithms can be applied to clustering in large multimedia databases. The effectiveness and efficiency of the existing algorithms, however, is somewhat limited, since clustering in multimedia databases requires clustering high-dimensional feature vectors and since multimedia databases often contain large amounts of noise. In this paper, we therefore introduce a new algorithm to clustering in large multimedia databases called DENCLUE (DENsitybased CLUstEring). The basic idea of our new approachis  to model the overall point density analytically as the sum of influence functions of the data points. Clusters can then be identified by determining density-attractors and clusters of arbitrary shape can be easily described by a simple equation based on the overall density function. The advantages of our new approach are (1) it has a firm mathematical basis, (2) it has good clustering properties in data sets with large amounts of noise, (3) it allows a compact mathematical ...
